Much of your programming is likely to have a natural decomposition into distinct logical tasks. 在您的多数编程工作中,您可能是将程序自然地分解为不同的逻辑任务。
The prevailing paradigm for programming was functional decomposition with procedural languages. 编程的主流范例是过程语言描述的功能分解。
Generally the optimization problems are solved with help of heuristic methods, such as genetic algorithm ( GA) and simulated algorithm ( SA), or mathematical ones containing integer programming algorithm and Benders decomposition method. 对于该优化问题,一般采用遗传算法、模拟退火算法等启发式方法或者整数规划法、Benders解耦法等数学规划方法加以求解。
Nonlinear programming techniques, branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method ( ICCG) are the three main parts of our work. 非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分。
Linear programming approach combines with technique in tree of decomposition to rea-lize fault location of large linear dynamic circuits quickly. 将线性规划方法与电路的树分解技术结合,实现大型线性动态电路中故障的迅速定位。
An approach for GTO launch trajectory optimization design is proposed, which is consisted of bilevel programming method, trajectory decomposition optimization design and hybrid Genetic Algorithm. 文章提出了包含两级规划、轨道分解优化以及混合遗传算法的GTO发射轨道优化设计策略。
As to the complex transportation network problem arising from multiple traffic tools a two-level dynamic programming approximate algorithm based on the recursive decomposition method of large scale system theory is discussed. 对于多种交通工具联合运输的复杂网络问题,本文应用大系统理论的递阶分解方法,讨论了一个两级动态规划处理方法。
To extend successive quadratic programming ( SQP) to handle large scale chemical process optimization successfully, a set of integrated reduced Hessian SQP ( IRHSQP) algorithm based on coordinate bases decomposition is developed, which exploits the low dimensionality of the subspace of the decision variables. 针对化工系统流程优化问题中决策变量子空间维数低的特点,提出了基于坐标基分解的综合简约HessianSQP算法,并直接用于大规模优化问题求解;
Using the method of multi stage decision based on non linear programming to do multi scale wavelet decomposition of objective function and doing successively inversion from large scale to small scale, the redundance of objective function has been overcome. 采用非线性规划的多阶段决策方法对目标函数作小波多尺度分解,由大尺度到小尺度逐次反演,消除了目标函数的冗余度,并克服了目标函数的复杂性。
This paper transforms above problems into nonlinear programming with implicit constraints ( i. e. dynamic constraints), and also discusses the decomposition of this programming and the properties of the objective function, and therefore gives optimization algorithm that can be implemented on micro-computers and. practical applications. 本文将该问题转化为隐式约束(即动态约束)非线性规划,并讨论规划的分解及目标函数的性质,从而给出了可在微机上实现的优化算法和实际应用。
In this paper, according to the property of oil-fields programming, we have advanced a method of "divided layer and decomposition and unify", which ison the problem of large-scale programming. 本文依据油田规划的特点,提出了大规模规划问题的“分层分解统一协调”方法。分析了这种方法的性质。
Aimed at the large-scale programming with coupling variables, the paper presents a three-level decomposition model and discusses the coordination algorithm for the three-level decomposition model. 本文针对变量耦合下的一类大规模数学规划问题,给出了其三级分解模型,并讨论了三级模型的协调求解算法。
Subsequently, the paper explains the methodology of mathematical programming and the theory of decomposition and harmony as the mathematical background of pump operational model, then probes into optimal pump operational models. 在简要的介绍优化调度的数学背景动态规划和大系统分解协调技术后,探讨了泵站优化调度的模型。采用动态规划思想和分解协调技术对模型进行求解。
Solving the proposed model is a mixed integer nonlinear programming problem and is optimized by multi-population genetic algorithm, thus the divergence of solution caused by Benders decomposition can be avoided. 求解该模型是一个混合整数非线性规划问题,采用多种群遗传算法来进行优化,避免了采用Benders分解带来的解的发散问题。
Based on dynamic programming, a time-varying wavelet packets decomposition algorithm is proposed. 该文提出了一种基于动态规划的时变小波包分解算法。
In this paper, an improvement in the piecewise linear homotopy algorithm for quadratic programming which has been proposed by us is presented. The improvement is realized as the results of making use of Cholesky decomposition and Gauss elimination and appropriate definitions of homotopy mappings. 本文利用Cholesky分解、Gauss消去等技术和定义适当的同伦映射,将关于二次规划问题的分段线性同伦算法加以改进。
This paper is concerned with the method of single reservoir optimal operation using Progressive Optimality Algorithms, Dynamic Programming and Large System Decomposition and Cooperation as well as Genetic Algorithms. 用逐步优化算法、动态规划法、大系统法和遗传算法,研究单一水库优化调度问题;
Searching basic feasible solution for linear programming using QR decomposition 利用QR分解寻求线性规划的初始解
At the same time the method of dynamic programming and decomposition and harmony are used to get the solution of the models. 采用动态规划思想和分解协调技术对模型进行求解。
Discussed some kinds of support vector machine algorithm in detail, analyzed quadratic programming algorithm and compared analysis the classification performance of several kinds about decomposition method. 详细讨论了目前主要的几类支持向量机训练算法,分析了二次规划算法,比较分析了几种分解算法的分类性能。
To some practical problems, such as uneven distribution of water resources and difficult to deploy, using dynamic programming and large scale system decomposition and coordination techniques, and set up a water scheduling model. 本课题以北京市供水系统为背景,针对水资源空间分布不均,调配难度大等现实问题,采用动态规划法和大系统分解与协调技术,建立了一种水资源调度系统模型。
Based on the study of some researchers, we study several new algorithms and its applications for two-stage stochastic programming, especially on how to apply adaptive multicut aggregation method and level decomposition to two-stage stochastic programming. 在前人研究的基础上,对两阶段随机规划问题的新算法及其在实际中的应用进行了研究,特别是对求解两阶段随机规划问题的自适应多切割聚合算法和水平分解算法进行了深入探讨。
In order to reduce the time of control points, this paper calculated by the dynamic programming optimization method. This paper used wavelet method decomposition the image. 为了减少动态规划优化方法中控制点的求取时间,引入小波理论对图像进行分辨率分解。
In recent years, considerable attention has been devoted to the study of polynomial systems in numerical approach, especially using semidefinite programming and the sum of squares decomposition, which provide an efficient way for researchers to explore polynomial systems. 近年来,通过数值计算方法对多项式系统的进行研究得到了人们广泛的关注,尤其是半定规划和平方和分解方法,为学者研究多项式系统提供了有效的方法。
Simultaneous approach can deal with state variables path constraints and only solves model equations at optimal point, but it generates a large nonlinear programming problem which requires special decomposition technique. 联立算法可以处理状态变量的路径约束,仅在最优点处求解一次模型方程,其缺点是寻优变量多,产生非常大的非线性规划问题,需要特殊的求解策略和数学处理。
The VRP is formulated as a mix-integer programming model with the objective to minimize the total traveling distance. By using the Danzig-Wolfe decomposition, this model is transformed into a set partitioning ( SP) model and a pricing subproblem model. 本文介绍了VRP的精确算法,给出了一个以行驶距离最小为目标的混合整数规划模型,通过Danzig-wolfe分解,把该模型转化成了集合划分(SP)模型和子问题模型。